Extending SAT-Solvers to Low-Degree Extension Fields of GF(2)
نویسنده
چکیده
8th Central European Conference on Cryptography 2008 1 Table 1. Experimental Results: Magma, Singular, and Mini-SAT. Num Vars Num Eqns β or Sparsity Magma Singular SAT 2 2 1.0 0.02 sec 0.01 sec 0.01 sec 3 3 1.0 0.04 sec 0.04 sec 0.07 sec 4 4 1.0 0.43 sec 423.48 sec 213.56 sec 5 5 1.0 4.32 sec > 75 mins 19278.9 sec 6 6 1.0 42.78 sec no trial > 75 mins 7 7 1.
منابع مشابه
Computational Methods
Efficient methods for conversion and solution of sparse systems of low-degree multivariate polynomials over GF(2) via SAT-solvers, 2007. Computing restrictions of ideals in finitely generated k-algebras by means of Buchberger's algorithm,
متن کاملEfficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملAlgorithms for Solving Linear and Polynomial Systems of Equations over Finite Fields with Applications to Cryptanalysis
Title of dissertation: ALGORITHMS FOR SOLVING LINEAR AND POLYNOMIAL SYSTEMS OF EQUATIONS OVER FINITE FIELDS WITH APPLICATIONS TO CRYPTANALYSIS Gregory Bard Doctor of Philosophy, 2007 Dissertation directed by: Professor Lawrence C. Washington Department of Mathematics This dissertation contains algorithms for solving linear and polynomial systems of equations over GF(2). The objective is to prov...
متن کاملSummation Polynomial Algorithms for Elliptic Curves in Characteristic Two
The paper is about the discrete logarithm problem for elliptic curves over characteristic 2 finite fields F2n of prime degree n. We consider practical issues about index calculus attacks using summation polynomials in this setting. The contributions of the paper include: a choice of variables for binary Edwards curves (invariant under the action of a relatively large group) to lower the degree ...
متن کاملLearning Polynomials over GF(2) in a SAT Solver - (Poster Presentation)
One potential direction for improving the performance of SAT solvers is by using a stronger underlying proof system, e.g., [1]. We propose a step in improving the learning architecture of SAT solvers and describe a learning scheme in the polynomial calculus with resolution (PCR), a proof system that generalizes both resolution and Gaussian elimination. The scheme fits the general structure of C...
متن کامل